Intuitionistic validity in T-normal Kripke structures
نویسندگان
چکیده
منابع مشابه
Intuitionistic Validity in T-Normal Kripke Structures
Let T be a first-order theory. A T -normal Kripke structure is one in which every world is a classical model of T . This paper gives a characterization of the intuitionistic theory HT of sentences intuitionistically valid (forced) in all T -normal Kripke structures and proves the corresponding soundness and completeness theorems. For Peano arithmetic (PA), the theory HPA is a proper subtheory o...
متن کاملIntuitionistic and Classical Satisfiability in Kripke Models
A class P ∗ of formulas was defined in [4] which whenever satisfied in a classical structure associated with a node of a Kripke model must also be forced at that node. Here we define a dual class R of formulas which whenever forced at a node of a Kripke model must be satisfied in the classical structure associated with that node.
متن کاملCSP and Kripke Structures
A runtime verification technique has been developed for CSP via translation of CSP models to Kripke structures. With this technique, we can check that a system under test satisfies properties of traces and refusals of its CSP model. This complements analysis facilities available for CSP and for all languages with a CSP-based semantics: Safety-Critical Java, Simulink, SysML, and so on. Soundness...
متن کاملConcurrent Kripke Structures
We consider a class of Kripke Structures in which the atomic propositions are events. This enables us to represent worlds as sets of events and the transition and satisfaction relations of Kripke structures as the subset and membership relations on sets. We use this class, called event Kripke structures, to model concurrency. The obvious semantics for these structures is a true concurrency sema...
متن کاملIntuitionistic axiomatizations for bounded extension Kripke models
We present axiom systems, and provide soundness and strong completeness theorems, for classes of Kripke models with restricted extension rules among the node structures of the model. As examples we present an axiom system for the class of co5nal extension Kripke models, and an axiom system for the class of end-extension Kripke models. We also show that Heyting arithmetic (HA) is strongly comple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1993
ISSN: 0168-0072
DOI: 10.1016/0168-0072(93)90091-q